Sub-computable Boundedness Randomness
نویسندگان
چکیده
This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for PSPACE functions. These new notions are robust in that there are equivalent formulations in terms of (1) Martin-Löf tests, (2) Kolmogorov complexity, and (3) martingales. We show these notions can be equivalently defined with prefix-free Kolmogorov complexity. We prove that one direction of van Lambalgen’s theorem holds for relative computability, but the other direction fails. We discuss statistical properties of these notions of randomness.
منابع مشابه
Computable Versions of the Uniform Boundedness Theorem
We investigate the computable content of the Uniform Boundedness Theorem and of the closely related Banach-Steinhaus Theorem. The Uniform Boundedness Theorem states that a pointwise bounded sequence of bounded linear operators on Banach spaces is also uniformly bounded. But, given the sequence, can we also effectively find the uniform bound? It turns out that the answer depends on how the seque...
متن کاملSubcomputable Schnorr Randomness
The notion of Schnorr randomness refers to computable reals or computable functions. We propose a version of Schnorr randomness for subcomputable classes and characterize it in different ways: by Martin-Löf tests, martingales or measure computable machines. Mathematics Subject Classification: 03D25, 68Q15 .
متن کاملProbabilistic algorithmic randomness
We introduce martingales defined by probabilistic strategies, in which random bits are used to decide whether and how much to bet. We show that different criteria for the success of computable probabilistic strategies can be used to characterize ML-randomness, computable randomness, and partial computable randomness. Our characterization of MLrandomness partially addresses a critique of Schnorr...
متن کاملAlgorithmic randomness over general spaces
Algorithmic randomness over general spaces has been considered such as an effective topological space and a computable metric space. In this paper we generalize algorithmic randomness to a computable topological space. First we define computable measures on a computable topological space and study computability of the evaluation. Next we define randomnesses via three approaches. Measure randomn...
متن کاملLowness for Computable and Partial Computable Randomness
Ambos-Spies and Kucera [1, Problem 4.8] asked whether there is a non-computable set which is low for the computably random sets. We show that no such set exists. The same result holds for partial computable randomness. Each tally language that is low for polynomial randomness is on a polynomial time tree of bounded width. This research was done in 2003 but has not been published so far.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logical Methods in Computer Science
دوره 10 شماره
صفحات -
تاریخ انتشار 2014